Relating Hierarchies of Word and Tree Automata
نویسندگان
چکیده
For an !-word language L, the derived tree language Path(L) is the language of trees having all their paths in L. We consider the hierarchies of deterministic automata on words and nondeterministic automata on trees with Rabin conditions in chain form. We show that L is on some level of the hierarchy of deterministic word automata ii Path(L) is on the same level of the hierarchy of nondeterministic tree automata.
منابع مشابه
Relating Word and Tree Automata
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60’s, it was known that deterministic Büchi word automata are less expressive than nondeterministic Büchi word automata. The proof is easy and can be stated in a few lines. In the late 60’s, Rabin prov...
متن کاملRelating Word and Tree Automata - Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
I n the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's) it was known that deterministic Biichi word automata are less expressive than nondeterministic Biichi word automata. The proof is easy and can be stated in a few lines. I n the late 60's) Rabin ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملLinear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However, when it comes to non-deterministic tree automata, none of these hierarchies is even close to be understood. Here we make an attempt in paving the way towards a clear understanding of tree automata. We concentrate on the class ...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998